Maximal Benefit Location Problem for A Congested System
Authors
Abstract:
Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known probability. The objective is to maximize the total benefit. In this paper, the problem is formulated, three solution algorithms are developed and applied to some numerical examples to analyze the results.
similar resources
maximal benefit location problem for a congested system
some servers are to be located at nodes of a network. demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. customers may waive receiving service with a known proba...
full textA Congested Facility Location Problem
Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are repo...
full textPropose a Fuzzy Queuing Maximal Benefit Location Problem
This paper presents a fuzzy queuing location model for congested system. In a queuing system there are different criteria that are not constant such as service rate, service rate demand, queue length, the occupancy probability of a service center and Probability of joining the queue line. In this paper with fuzzifying all of these variables, will try to reach an accurate real problem. Finally w...
full textA Congested Double Path Approach for a Hub Location-allocation Problem with Service Level at Hubs
In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...
full textGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
full textA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
full textMy Resources
Journal title
volume Volume 3 issue Issue 5
pages 73- 83
publication date 2010-01-18
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023